An Exact Branch and Bound Algorithm for the General Quadratic Assignment Problem
نویسندگان
چکیده
This research is concerned with the development of an exact algorithm for a general quadratic assignment problem (QAP), of which the Koopmans-Beckmann formulation, in the context of an analysis of the location of economic activities or facilities, is a special case. The algorithm is based on the linearization of a general QAP of size n into a linear assignment problem of size n(n-l)/2. The objective value and the dual solution of this subproblem are used to compute the lower bound used in an exact branch and bound procedure. Computational experience and comparisons to other well known methods are discussed.
منابع مشابه
Offering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملExact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
This paper introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique, defined in accordance to the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound at each constructive step. The second is a branch and bound exact approach, containing some elements introduced in the Ant algorithm. Computational results p...
متن کاملLower Bounds for the Quadratic Assignment Problem
We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new lower bounds have advantages over previous bounds and can be used in a branch-and-bound type algorithm for...
متن کامل